The isomorphism problem for monoid rings of rank 2 monoids *
نویسنده
چکیده
The main result of this paper is that for a commutative ring R and finitely generated submonoids M and N of Z2 the monoid rings R [M] and R[N] are isomorphic as R algebras if and only if M and N are isomorphic. In the course of proof we derive various results concerning the structure of rank 2 monoids and isomorphisms between the corresponding monoid rings. 1991 Math. Subj. Class.: 13B25, 20M25, 14M25
منابع مشابه
Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings
A rst explicit connection between nitely presented commutative monoids and ideals in polynomial rings was used 1958 by Emelichev yielding a solution to the word problem in commutative monoids by deciding the ideal membership problem. The aim of this paper is to show in a similar fashion how congruences on monoids and groups can be characterized by ideals in respective monoid and group rings. Th...
متن کاملOn zero divisor graph of unique product monoid rings over Noetherian reversible ring
Let $R$ be an associative ring with identity and $Z^*(R)$ be its set of non-zero zero divisors. The zero-divisor graph of $R$, denoted by $Gamma(R)$, is the graph whose vertices are the non-zero zero-divisors of $R$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$. In this paper, we bring some results about undirected zero-divisor graph of a monoid ring o...
متن کاملWord Problem Languages for Free Inverse Monoids
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context...
متن کاملar X iv : 0 71 0 . 37 11 v 1 [ m at h . R A ] 1 9 O ct 2 00 7
We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids. We show that for polycyclic monoids of rank 2 or more, such automata accept exactly the context-free languages. For the polycyclic monoid of rank 1 (that is...
متن کاملThe isomorphism problem for commutative monoid rings’
By substantial changes and corrections in Demushkin’s old paper the essentially final positive answer to the isomorphism problem for monoid rings of submonoids of Z’ is obtained. This means that the underlying monoid is shown to be determined (up to isomorphism) by the corresponding monoid ring. Thereafter the positive answer to the analogous question for the ‘dual’ objects descrete Hodge algeb...
متن کامل